Equivalent Conditions for Jacobian Nonsingularity in Linear Symmetric Cone Programming
نویسندگان
چکیده
منابع مشابه
Equivalent Conditions for Jacobian Nonsingularity in Linear Symmetric Cone Programming
In this paper we consider the linear symmetric cone programming (SCP). At a KarushKuhn-Tucker (KKT) point of SCP, we present the important equivalent conditions for the nonsingularity of Clarke’s generalized Jacobian of the KKT nonsmooth system, such as primal and dual constraint nondegeneracy, the strong regularity, and the nonsingularity of the B-subdifferential of the KKT system. This affirm...
متن کاملNonsingularity Conditions for FB System of Reformulating Nonlinear Second-Order Cone Programming
and Applied Analysis 3 x ∈ R. For each x = (x1, x2) ∈ R × R , we define the associated arrow matrix by Lx := [ x1 x T 2 x2 x1I ] . (14) Then it is easy to verify that Lxy = x ∘ y for any x, y ∈ R . Recall that each x = (x1, x2) ∈ R × R n−1 admits a spectral factorization, associated withK, of the form x = λ1 (x) u (1) x + λ2 (x) u (2) x , (15) where λ1(x), λ2(x) ∈ R and u (1) x , u (2) x ∈ R n ...
متن کاملNonsingularity conditions for FB system of reformulating nonlinear second - order cone programming 1
This paper is a counterpart of [2]. Specifically, for a locally optimal solution to the nonlinear second-order cone programming (SOCP), under Robinson’s constraint qualification, we establish the equivalence among the following three conditions: the nonsingularity of Clarke’s Jacobian of Fischer-Burmeister (FB) nonsmooth system for the Karush-Kuhn-Tucker conditions, the strong second-order suff...
متن کاملThe Q Method for Symmetric Cone Programming
The Q method of semidefinite programming, developed by Alizadeh, Haeberly and Overton, is extended to optimization problems over symmetric cones. At each iteration of the Q method, eigenvalues and Jordan frames of decision variables are updated using Newton’s method. We give an interior point and a pure Newton’s method based on the Q method. In another paper, the authors have shown that the Q m...
متن کاملTarget-following framework for symmetric cone programming
We extend the target map, together with the weighted barriers and the notions of weighted analytic centers, from linear programming to general convex conic programming. This extension is obtained from a novel geometrical perspective of the weighted barriers, that views a weighted barrier as a weighted sum of barriers for a strictly decreasing sequence of faces. Using the Euclidean Jordan-algebr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 2010
ISSN: 0022-3239,1573-2878
DOI: 10.1007/s10957-010-9758-2